منابع مشابه
SAT-based MaxSAT algorithms
Article history: Received 19 June 2012 Received in revised form 3 January 2013 Accepted 13 January 2013 Available online 21 January 2013
متن کاملMaxSAT-Based MCS Enumeration
Enumeration of Minimal Correction Sets (MCS) finds a wide range of practical applications, including the identification of Minimal Unsatisfiable Subsets (MUS) used in verifying the complex control logic of microprocessor designs (e.g. in the CEGAR loop of Reveal [1,2]). Current state of the art MCS enumeration exploits core-guided MaxSAT algorithms, namely the so-called MSU3 [15] MaxSAT algorit...
متن کاملSAT-Based Preprocessing for MaxSAT
State-of-the-art algorithms for industrial instances of MaxSAT problem rely on iterative calls to a SAT solver. Preprocessing is crucial for the acceleration of SAT solving, and the key preprocessing techniques rely on the application of resolution and subsumption elimination. Additionally, satisfiability-preserving clause elimination procedures are often used. Since MaxSAT computation typicall...
متن کاملPreference-Based Planning via MaxSAT
In this paper, we explore the application of partial weighted MaxSAT techniques for preference-based planning (PBP). To this end, we develop a compact partial weighted MaxSAT encoding for PBP based on the popular SAS planning formalism. Our encoding extends a SAS based encoding for SAT-based planning, SASE, to allow for the specification of simple preferences. To the best of our knowledge, the ...
متن کاملRobustness-based portfolio optimization under epistemic uncertainty
In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2012
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-012-9130-2